On the H-Manipulability of Fuzzy Social Choice Functions

نویسندگان

  • Fouad Ben Abdelaziz
  • José Figueira
  • Olfa Meddeb
چکیده

In voting theory the well-known Gibbard-Satterthwaite theorem is about the manipulability of aggregators which consists of the aggregation of individual preferences expressed as a complete ordering over the set of alternatives. This paper deals with the generalization of such a theorem in a context where each individual expresses a fuzzy preference (weak) ordering. This extension is called H-manipulability. The concept of fuzzy game form as the generalization of Gibbard’s concept game form is also introduced here in a fuzzy framework. The proof of the Hmanipulability theorem is relied on the connection of fuzzy social choice functions with fuzzy aggregation rules. In particular, the dictatorship of fuzzy aggregation rules corresponds to the H-dictatorship fuzzy social choice.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the manipulability of the fuzzy social choice functions

In the social decision making context, a manipulator attempts to change the social choice in his favor by misrepresenting his preferences. Gibbard and Satterthwaite [7,10] established independently that a strategic manipulation can be observed when using any non-dictatorial voting choice procedure. In this paper, we are interested in the manipulation of the social choice when individuals reveal...

متن کامل

Some Generalizations of the Manipulability of Fuzzy Social Choice Functions

This paper presents some generalizations of the Gibbard -Satterthwaite result (1973, 1975) for fuzzy preference relations. It explores the implication of weakening the transitivity condition of the Ben Abdealziz et al.’s (2008) fuzzy manipulability concept. For this purpose, the max-min transitivity is replaced by weaker transitivity: the max-?-transitivity, where ? is a t-norm. In addition, th...

متن کامل

On characterizations of the fully rational fuzzy choice functions

In the present paper, we introduce the fuzzy Nehring axiom, fuzzy Sen axiom and weaker form of the weak fuzzycongruence axiom. We establish interrelations between these axioms and their relation with fuzzy Chernoff axiom. Weexpress full rationality of a fuzzy choice function using these axioms along with the fuzzy Chernoff axiom.

متن کامل

Computing the Degree of Manipulability in the Case of Multiple Choice

The problem of the manipulability of known social choice rules in the case of multiple choice is considered. Several concepts of expanded preferences (preferences over the sets of alternatives) are elaborated. As a result of this analysis ordinal and nonordinal methods of preferences expanding are defined. The notions of the degree of manipulability are extended to the case under study. Using t...

متن کامل

Minimal manipulability: anonymity and unanimity

This paper is concerned with the minimal number of profiles at which a unanimous and anonymous social choice function is manipulable. The lower bound is derived when there are three alternatives to choose from. Examples of social choice functions attaining the lower bound are given. We conjecture that these examples are in fact all minimally manipulable social choice functions. Since some of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005